A standardisation proof for algebraic pattern calculi
نویسندگان
چکیده
منابع مشابه
A standardisation proof for algebraic pattern calculi
ion in this case N must also be an abstraction for both (i) and (ii) and neither N → h R nor N p R for any p,R. application in this case M = M1M2 We prove (i) first, analysing the possible forms of M1 • Assume M1 is not an abstraction In this case IApp1 applies, so we know N = N1N2, M1 int ⊲ N1, and M2 ⊲N2. Since M1 int ⊲ N1, N1 is not an abstraction, then the only applicable rule for N → h R i...
متن کاملAlgebraic Models and Complete Proof Calculi for Classical BI
We consider the classical (propositional) version, CBI, of O’Hearn and Pym’s logic of bunched implications (BI) from a modeland proof-theoretic perspective. We make two main contributions in this paper. Firstly, we present a class of algebraic models for CBI which permit the full range of classical multiplicative connectives to be modelled. Our models can be seen as generalisations of Abelian g...
متن کاملAn Algebraic Approach to Proof Search in Sequent Calculi
Inference rules in the sequent calculus can be interpreted as both proof construction rules and proof search rules. However, the kind of information used in each case is somewhat different. In this paper we explore these differences by using a multiple-conclusioned sequent calculus for intuitionistic logic (LM) as a search calculus for proofs in the single-conclusioned intuitionistic sequent ca...
متن کاملProof Confluent Tableau Calculi
A tableau calculus is proof confluent if every partial tableau proof for an unsatisfiable formula can be extended to a closed tableau. A rule application may be redundant but it can never prevent the construction of a proof; there are no “dead ends” in the proof search. Proof confluence is a prerequisite of (a) backtrackingfree proof search and (b) the generation of counter examples to non-theo...
متن کاملReversing Algebraic Process Calculi
Reversible computation has a growing number of promising application areas such as the modelling of biochemical systems, program debugging and testing, and even programming languages for quantum computing. We formulate a procedure for converting operators of standard algebraic process calculi such as CCS, ACP and CSP into reversible operators, while preserving their operational semantics.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2011
ISSN: 2075-2180
DOI: 10.4204/eptcs.49.5